skip to main content


Search for: All records

Creators/Authors contains: "Cao, Shuhao"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Finite element methods for electromagnetic problems modeled by Maxwell-type equations are highly sensitive to the conformity of approximation spaces, and non-conforming methods may cause loss of convergence. This fact leads to an essential obstacle for almost all the interface-unfitted mesh methods in the literature regarding the application to electromagnetic interface problems, as they are based on non-conforming spaces. In this work, a novel immersed virtual element method for solving a three-dimensional (3D) H(curl) interface problem is developed, and the motivation is to combine the conformity of virtual element spaces and robust approximation capabilities of immersed finite element spaces. The proposed method is able to achieve optimal convergence. To develop a systematic framework, the [Formula: see text], H(curl) and H(div) interface problems and their corresponding problem-orientated immersed virtual element spaces are considered all together. In addition, the de Rham complex will be established based on which the Hiptmair–Xu (HX) preconditioner can be used to develop a fast solver for the H(curl) interface problem. 
    more » « less
  2. In this paper, we apply the self-attention from the state-of-the-art Transformer in Attention Is All You Need for the first time to a data-driven operator learning problem related to partial differential equations. An effort is put together to explain the heuristics of, and to improve the efficacy of the attention mechanism. By employing the operator approximation theory in Hilbert spaces, it is demonstrated for the first time that the softmax normalization in the scaled dot-product attention is sufficient but not necessary. Without softmax, the approximation capacity of a linearized Transformer variant can be proved to be comparable to a Petrov-Galerkin projection layer-wise, and the estimate is independent with respect to the sequence length. A new layer normalization scheme mimicking the Petrov-Galerkin projection is proposed to allow a scaling to propagate through attention layers, which helps the model achieve remarkable accuracy in operator learning tasks with unnormalized data. Finally, we present three operator learning experiments, including the viscid Burgers' equation, an interface Darcy flow, and an inverse interface coefficient identification problem. The newly proposed simple attention-based operator learner, Galerkin Transformer, shows significant improvements in both training cost and evaluation accuracy over its softmax-normalized counterparts. 
    more » « less
  3. A virtual element method (VEM) with the first-order optimal convergence order is developed for solving two-dimensional Maxwell interface problems on a special class of polygonal meshes that are cut by the interface from a background unfitted mesh. A novel virtual space is introduced on a virtual triangulation of the polygonal mesh satisfying a maximum angle condition, which shares exactly the same degrees of freedom as the usual [Formula: see text]-conforming virtual space. This new virtual space serves as the key to prove that the optimal error bounds of the VEM are independent of high aspect ratio of the possible anisotropic polygonal mesh near the interface. 
    more » « less
  4. Abstract

    An adaptive modified weak Galerkin method (AmWG) for an elliptic problem is studied in this article, in addition to its convergence and optimality. The modified weak Galerkin bilinear form is simplified without the need of the skeletal variable, and the approximation space is chosen as the discontinuous polynomial space as in the discontinuous Galerkin method. Upon a reliable residual‐baseda posteriorierror estimator, an adaptive algorithm is proposed together with its convergence and quasi‐optimality proved for the lowest order case. The primary tool is to bridge the connection between the modified weak Galerkin method and the Crouzeix–Raviart nonconforming finite element. Unlike the traditional convergence analysis for methods with a discontinuous polynomial approximation space, the convergence of AmWG is penalty parameter free. Numerical results are presented to support the theoretical results.

     
    more » « less
  5. In this paper, we introduce a simple local flux recovery for \begin{document}$ \mathcal{Q}_k $\end{document} finite element of a scalar coefficient diffusion equation on quadtree meshes, with no restriction on the irregularities of hanging nodes. The construction requires no specific ad hoc tweaking for hanging nodes on \begin{document}$ l $\end{document}-irregular (\begin{document}$ l\geq 2 $\end{document}) meshes thanks to the adoption of virtual element families. The rectangular elements with hanging nodes are treated as polygons as in the flux recovery context. An efficient a posteriori error estimator is then constructed based on the recovered flux, and its reliability is proved under common assumptions, both of which are further verified in numerics.

     
    more » « less